Robust Stealthy Attacks Based on Uncertain Costs and Labeled Finite Automata With Inputs

نویسندگان

چکیده

This letter deals with the vulnerability analysis of cyber-physical systems subject to malicious actions. For this purpose, considered system is assumed be abstracted as a discrete event system. Labeled finite automata inputs are used model system's behavior along information that circulates in both input and output channels. In particular, we study here stealthy, i.e., undetectable, cyber-attacks aim drive from given normal state set forbidden states. We assume attacker has limited resources, credit, insert delete control sensors events. The proposed evaluates costs such attacks on controlled depending its structure, cost actions possible uncertainties may affect those costs. It provides systematic methods compute minimal robust weakly impacted by uncertainties. A case representing manufacturing plant illustrate results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Wagner–Whitin algorithm with uncertain costs

In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...

متن کامل

Finite-State Automata on Infinite Inputs

This paper is a self-contained introduction to the theory of finite-state automata on infinite words. The study of automata on infinite inputs was initiated by Büchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed intere...

متن کامل

Finite - state Automata on In nite Inputs

This paper is a self-contained introduction to the theory of nite-state automata on innnite words. The study of automata on innnite inputs was initiated by B uchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed interest ...

متن کامل

Robust shortest path problems with uncertain costs

Data coming from real-world applications are very often affected by uncertainty. On the other hand, it is difficult to translate uncertainty in terms of combinatorial optimization. In this paper we study a combinatorial optimization model to deal with uncertainty in arc costs in shortest path problems. We consider a model where feasible arc cost scenarios are described via a convex polytope. We...

متن کامل

Robust portfolio selection with polyhedral ambiguous inputs

 Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2023

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2023.3250007